ScreeNOT: Exact MSE-optimal singular value thresholding in correlated noise
نویسندگان
چکیده
We derive a formula for optimal hard thresholding of the singular value decomposition in presence correlated additive noise; although it nominally involves unobservables, we show how to apply even where noise covariance structure is not priori known or independently estimable. The proposed method, which call ScreeNOT, mathematically solid alternative Cattell’s ever-popular but vague scree plot heuristic from 1966. ScreeNOT has surprising oracle property: typically achieves exactly, large finite samples, lowest possible MSE matrix recovery, on each given problem instance, that is, specific threshold selects gives exactly smallest achievable loss among all choices noisy data set and unknown underlying true low rank model. method computationally efficient robust against perturbations structure. Our results depend assumption values have limiting empirical distribution compact support; this property, standard random theory, satisfied by many models exhibiting either cross-row correlation cross-column structure, also situations with more general, interelement Simulations demonstrate effectiveness at moderate sizes. paper supplemented ready-to-use software packages implementing algorithm: package Python (via PyPI) R CRAN).
منابع مشابه
Generalized Singular Value Thresholding
This work studies the Generalized Singular Value Thresholding (GSVT) operator Proxg (·), Proxg (B) = argmin X m ∑
متن کاملGeneralized Singular Value Thresholding
This work studies the Generalized Singular Value Thresholding (GSVT) operator Proxg (·), Proxg (B) = argmin X m ∑
متن کاملFast Singular Value Thresholding without Singular Value Decomposition
Singular value thresholding (SVT) is a basic subroutine in many popular numerical schemes for solving nuclear norm minimization that arises from low-rank matrix recovery problems such as matrix completion. The conventional approach for SVT is first to find the singular value decomposition (SVD) and then to shrink the singular values. However, such an approach is time-consuming under some circum...
متن کاملHybrid Singular Value Thresholding for Tensor Completion
In this paper, we study the low-rank tensor completion problem, where a high-order tensor with missing entries is given and the goal is to complete the tensor. We propose to minimize a new convex objective function, based on log sum of exponentials of nuclear norms, that promotes the low-rankness of unfolding matrices of the completed tensor. We show for the first time that the proximal operato...
متن کاملSupplementary Material of Generalized Singular Value Thresholding
Canyi Lu, Changbo Zhu, Chunyan Xu, Shuicheng Yan, Zhouchen Lin3,∗ 1 Department of Electrical and Computer Engineering, National University of Singapore 2 School of Computer Science and Technology, Huazhong University of Science and Technology 3 Key Laboratory of Machine Perception (MOE), School of EECS, Peking University [email protected], [email protected], [email protected], eleyans@n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Statistics
سال: 2023
ISSN: ['0090-5364', '2168-8966']
DOI: https://doi.org/10.1214/22-aos2232